The number of <i>K</i>-tons in the coupon collector problem

Abstract Consider the coupon collector problem where each box of a brand cereal contains and there are n different types coupons. Suppose that probability containing specific type is $1/n$ , we keep buying boxes until collect at least m coupons type. For $k\geq m$ call certain k-ton if see it k times by time have seen copies all Here determine asymptotic distribution number k-tons after collected for any in restricted range, given fixed . We also joint over such values total collected.